符合使用机器学习的不断增长的趋势,帮助解决组合优化问题,一个有希望的想法是通过使用学习的策略来改善混合整数编程(MIP)分支和绑定树内的节点选择。以前使用模仿学习的工作指示通过学习自适应节点搜索顺序来获取节点选择策略的可行性。相比之下,我们的模仿学习策略仅专注于学习节点的孩子中的哪一个选择。我们介绍了一个脱机方法,用于在两个设置中学习这样的策略:一个通过致力于修剪节点的启发式;一个是从叶子精确和背溯以保证找到最佳整数解决方案的备用。前一个设置对应于困扰期间的儿童选择器,而后者则类似于潜水启发式。我们在热情和确切的设置中将策略应用于流行的开源求解器SCIP。五个MIP数据集的经验结果表明,我们的节点选择策略比文献中最先进的先例更快地导致解决方案。虽然我们在精确解决方案的时间内没有击败高度优化的SCIP状态基准节点选择器,但如果预测模型的准确性足够,我们的启发式政策比所有基线都具有始终如一的最佳最优性差距。此外,结果还表明,当应用时间限制时,我们的启发式方法发现比测试大多数问题中所有基线的更好的解决方案。我们通过表明学习的政策模仿了SCIP基线来解释结果,但没有后者早期的暴跌中止。我们的建议是,尽管对文献的清晰改进,但这种MIP儿童选择器在更广泛的方法中更好地使用MIP分支和束缚树决策。
translated by 谷歌翻译
Ranking intuitionistic fuzzy sets with distance based ranking methods requires to calculate the distance between intuitionistic fuzzy set and a reference point which is known to have either maximum (positive ideal solution) or minimum (negative ideal solution) value. These group of approaches assume that as the distance of an intuitionistic fuzzy set to the reference point is decreases, the similarity of intuitionistic fuzzy set with that point increases. This is a misconception because an intuitionistic fuzzy set which has the shortest distance to positive ideal solution does not have to be the furthest from negative ideal solution for all circumstances when the distance function is nonlinear. This paper gives a mathematical proof of why this assumption is not valid for any of the non-linear distance functions and suggests a hypervolume based ranking approach as an alternative to distance based ranking. In addition, the suggested ranking approach is extended as a new multicriteria decision making method, HyperVolume based ASsessment (HVAS). HVAS is applied for multicriteria assessment of Turkey's energy alternatives. Results are compared with three well known distance based multicriteria decision making methods (TOPSIS, VIKOR, and CODAS).
translated by 谷歌翻译
A large portion of today's world population suffer from vision impairments and wear prescription eyeglasses. However, eyeglasses causes additional bulk and discomfort when used with augmented and virtual reality headsets, thereby negatively impacting the viewer's visual experience. In this work, we remedy the usage of prescription eyeglasses in Virtual Reality (VR) headsets by shifting the optical complexity completely into software and propose a prescription-aware rendering approach for providing sharper and immersive VR imagery. To this end, we develop a differentiable display and visual perception model encapsulating display-specific parameters, color and visual acuity of human visual system and the user-specific refractive errors. Using this differentiable visual perception model, we optimize the rendered imagery in the display using stochastic gradient-descent solvers. This way, we provide prescription glasses-free sharper images for a person with vision impairments. We evaluate our approach on various displays, including desktops and VR headsets, and show significant quality and contrast improvements for users with vision impairments.
translated by 谷歌翻译
With the boom of digital educational materials and scalable e-learning systems, the potential for realising AI-assisted personalised learning has skyrocketed. In this landscape, the automatic generation of educational questions will play a key role, enabling scalable self-assessment when a global population is manoeuvring their personalised learning journeys. We develop EduQG, a novel educational question generation model built by adapting a large language model. Our initial experiments demonstrate that EduQG can produce superior educational questions by pre-training on scientific text.
translated by 谷歌翻译
Digital sensors can lead to noisy results under many circumstances. To be able to remove the undesired noise from images, proper noise modeling and an accurate noise parameter estimation is crucial. In this project, we use a Poisson-Gaussian noise model for the raw-images captured by the sensor, as it fits the physical characteristics of the sensor closely. Moreover, we limit ourselves to the case where observed (noisy), and ground-truth (noise-free) image pairs are available. Using such pairs is beneficial for the noise estimation and is not widely studied in literature. Based on this model, we derive the theoretical maximum likelihood solution, discuss its practical implementation and optimization. Further, we propose two algorithms based on variance and cumulant statistics. Finally, we compare the results of our methods with two different approaches, a CNN we trained ourselves, and another one taken from literature. The comparison between all these methods shows that our algorithms outperform the others in terms of MSE and have good additional properties.
translated by 谷歌翻译
Image noise can often be accurately fitted to a Poisson-Gaussian distribution. However, estimating the distribution parameters from a noisy image only is a challenging task. Here, we study the case when paired noisy and noise-free samples are accessible. No method is currently available to exploit the noise-free information, which may help to achieve more accurate estimations. To fill this gap, we derive a novel, cumulant-based, approach for Poisson-Gaussian noise modeling from paired image samples. We show its improved performance over different baselines, with special emphasis on MSE, effect of outliers, image dependence, and bias. We additionally derive the log-likelihood function for further insights and discuss real-world applicability.
translated by 谷歌翻译
不确定性在未来预测中起关键作用。未来是不确定的。这意味着可能有很多可能的未来。未来的预测方法应涵盖坚固的全部可能性。在自动驾驶中,涵盖预测部分中的多种模式对于做出安全至关重要的决策至关重要。尽管近年来计算机视觉系统已大大提高,但如今的未来预测仍然很困难。几个示例是未来的不确定性,全面理解的要求以及嘈杂的输出空间。在本论文中,我们通过以随机方式明确地对运动进行建模并学习潜在空间中的时间动态,从而提出了解决这些挑战的解决方案。
translated by 谷歌翻译
焊接联合检查(SJI)是生产印刷电路板(PCB)的关键过程。在SJI期间发现焊料错误非常具有挑战性,因为焊接接头的尺寸很小,并且可能需要各种形状。在这项研究中,我们首先表明焊料的特征多样性低,并且可以作为精细颗粒的图像分类任务执行SJI,该任务侧重于难以固定的对象类。为了提高细粒度的分类精度,发现通过最大化熵来惩罚自信模型预测,在文献中很有用。与此信息内联,我们建议使用{\ alpha} -skew Jensen-Shannon Divergence({\ alpha} -js)来惩罚模型预测的信心。我们将{\ alpha} -js正则化与现有基于熵指定的方法和基于注意机制,分割技术,变压器模型和特定损耗函数的方法进行比较。我们表明,在细化的焊料联合分类任务中,所提出的方法可以达到不同模型的F1得分和竞争精度。最后,我们可视化激活图,并表明,凭借熵的规范化,更精确的类歧视区域是局部的,这也更适合噪声。接受代码将在这里接受。
translated by 谷歌翻译
在这项工作中,我们提出了一种可以使用单变量全局优化器来解决多元全局优化问题的元算法。尽管与多元案例相比,单变量的全球优化并没有得到太多关注,而多元案例在学术界和行业中更加强调。我们表明它仍然是相关的,可以直接用于解决多元优化的问题。我们还提供了相应的遗憾界限,并在具有强大的遗憾保证的情况下对非负噪声的强劲性,而单变量优化器的平均遗憾和单变量优化器的平均遗憾。
translated by 谷歌翻译
全球定位系统(GPS)已成为我们日常生活的一部分,其主要目标是提供地理位置服务。对于无人驾驶系统(UAS),地理定位能力是极为重要的必要性,使用惯性导航系统(INS)伴随着GPS的心脏而实现。没有地理位置服务,UAS将无法飞往目的地或回家。不幸的是,GPS信号可能会被堵塞,并在Urban Canyons中遇到多路径问题。我们的目标是提出一种替代方法,以降级或拒绝GPS信号时地理位置化UA。考虑到UAS在其平台上具有下降摄像头,可以在平台飞行时获得实时图像,因此我们将现代深度学习技术应用于地理定位。特别是,我们执行图像匹配,以在UAS获得的图像和卫星正尾之间建立潜在特征共轭物。特征匹配的典型应用遭受高层建筑物和该领域的新结构的影响,这些建筑物将不确定性引入同型估算中,因此导致地理定位性能差。取而代之的是,我们将GIS信息从OpenStreetMap(OSM)提取到语义段匹配的功能中,以纳入建筑物和地形类。 GIS掩码在选择语义匹配的功能时可以作为过滤器,从而增强了Coplanarity条件和UAS地理定位精度。发表论文后,我们的代码将在https://github.com/osupcvlab/ubiheredrone2021上公开获得。
translated by 谷歌翻译